class ATIME

Definition

For every $T : \mathbb{N} \to \mathbb{N}$, say that an alternating TM

#incomplete

See also

• polynomial hierarchy

References

1. S. Arora, B. Barak. Computational Complexity: A Modern Approach, Cambridge University Press, 2009, pp. 99-100.